Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
281	Curriculum Vitae Oliver Kullmann May 3, 2014 Contents 1 Personal information Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2014-05-03 07:04:35 Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability Conjunctive normal form Unsatisfiable core Theoretical computer science Mathematics Applied mathematics
282	An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic Sergey Berezin, Vijay Ganesh, and David L. Dill Stanford University {berezin,vganesh,dill}@stanford.edu Add to Reading List Source URL: hci.stanford.edu Language: English - Date: 2007-03-24 22:33:28 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean satisfiability problem Fourier–Motzkin elimination Satisfiability Modulo Theories Constraint satisfaction Theoretical computer science Applied mathematics Mathematics
283	SAT Encodings Sugar Nonogram OSS Summary . Add to Reading List Source URL: bach.istc.kobe-u.ac.jp Language: English - Date: 2010-04-19 00:19:44 Declarative programming Boolean satisfiability problem DPLL algorithm Conjunctive normal form Constraint satisfaction Solver Theoretical computer science Constraint programming Applied mathematics
284	Microsoft Word - pamphlet.doc Add to Reading List Source URL: www.satisfiability.org Language: English - Date: 2014-01-20 06:08:38 Logic in computer science Boolean algebra Constraint programming Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem True quantified Boolean formula Solver Theoretical computer science Applied mathematics Mathematics
285	Combinational Equivalence Checking Using Satisfiability and Recursive Learning João Marques-Silva Add to Reading List Source URL: eprints.soton.ac.uk Language: English - Date: 2009-12-08 13:36:52 Boolean algebra Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean satisfiability problem Conjunctive normal form Binary decision diagram Formal equivalence checking Theoretical computer science Mathematics Applied mathematics
286	674 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 21, NO. 6, JUNE 2002 Add to Reading List Source URL: cs-rutenbar.web.engr.illinois.edu Language: English - Date: 2013-02-06 13:34:03 Field-programmable gate array Boolean satisfiability problem Routing Channel router Place and route Conjunctive normal form Xilinx Electronic engineering Electronic design automation Theoretical computer science
287	B-Cubing: New Possibilities for Efficient SAT-Solving Domagoj Babi´c, Student Member, IEEE, Jesse Bingham, Student Member, IEEE, and Add to Reading List Source URL: www.domagoj-babic.com Language: English - Date: 2008-08-13 18:39:15 Applied mathematics Formal methods Automated theorem proving Constraint programming DPLL algorithm Tree Symbol Binary search tree Boolean satisfiability problem Theoretical computer science Mathematics Binary trees
288	Tool-Support for the Analysis of Hybrid Systems and Models Add to Reading List Source URL: www.date-conference.com Language: English - Date: 2007-03-14 18:49:09 Operations research Constraint programming Logic in computer science Electronic design automation Formal methods Satisfiability Modulo Theories Solver Boolean satisfiability problem Constraint satisfaction Theoretical computer science Applied mathematics Mathematics
289	Satisfiability Suggested Format Last revision: May 8, 1993 Add to Reading List Source URL: www.domagoj-babic.com Language: English - Date: 2008-09-07 21:05:56 Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Conjunctive normal form Maximum satisfiability problem Satisfiability 2-satisfiability Theoretical computer science Mathematics Applied mathematics
290	Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer Add to Reading List Source URL: ovid.cs.depaul.edu Language: English - Date: 2008-10-05 12:49:10 Boolean algebra Logic in computer science NP-complete problems Combinatorics Boolean satisfiability problem Electronic design automation Conjunctive normal form Partition True quantified Boolean formula Theoretical computer science Mathematics Computational complexity theory

UPDATE